Hex-MASCLE - hexagon based clustering with self healing abilities
نویسندگان
چکیده
In large wireless sensor networks, low energy consumption is a major challenge. Hence, deployed nodes have to organize themselves as energy efficient as possible to avoid unnecessary sensor and transceiver operations. The energy conserving operations are limited by the task of the network, usually the network has to guarantee complete functionality during its lifetime. The contribution of this paper completes the functionality-aware and energy-efficient clustering algorithm family MASCLE by two innovative algorithms. As already given by the MASCLEalgorithms, the proposed Hex-MASCLE algorithms combine advantages of temporal and spatial network fragmentation. In contrast to previous approaches, the shapes of the basic cells are given by regular hexagons, similar to honeycombs. In the present work, two possible versions for hexagon-based clustering with self-healing abilities are proposed and evaluated. As result, the applying sensor network achieve a significant improve of network lifetime. Additionally, the algorithms are more fault-tolerant against localization errors. Keywords-Wireless sensor networks; clustering; self-healing;
منابع مشابه
1 1 Ju n 20 01 EXPLICIT ENUMERATION OF 321 , HEXAGON – AVOIDING PERMUTATIONS
The 321,hexagon–avoiding (321–hex) permutations were introduced and studied by Billey and Warrington in [4] as a class of elements of Sn whose Kazhdan– Lusztig and Poincaré polynomials and the singular loci of whose Schubert varieties have certain fairly simple and explicit descriptions. This paper provides a 7–term linear recurrence relation leading to an explicit enumeration of the 321–hex pe...
متن کاملDense near polygons with two types of quads and three types of hexes
We show that the number of points at distance i from a given point x in a dense near polygon only depends on i and not on the point x. We give a number of easy corollaries of this result. Subsequently, we look to the case of dense near polygons S with an order in which there are two possibilities for tQ, where Q is a quad of S, and three possibilities for (tH , vH), where H is a hex of S. Using...
متن کاملJu n 20 01 EXPLICIT ENUMERATION OF 321 , HEXAGON – AVOIDING PERMUTATIONS
The 321,hexagon–avoiding (321–hex) permutations were introduced and studied by Billey and Warrington in [4] as a class of elements of Sn whose Kazhdan– Lusztig and Poincaré polynomials and the singular loci of whose Schubert varieties have certain fairly simple and explicit descriptions. This paper provides a 7–term linear recurrence relation leading to an explicit enumeration of the 321–hex pe...
متن کاملInfinite Regular Hexagon Sequences on a Triangle
The well-known dual pair of Napoleon equilateral triangles intrinsic to each triangle is extended to infinite sequences of them, shown to be special cases of infinite regular hexagon sequences on each triangle. A set of hexagon-to-hexagon transformations, the hex operators, is defined for this purpose, a set forming an abelian monoid under function composition. The sequences result from arbitra...
متن کاملSelf-healing in payment switches with a focus on failure detection using State Ma- chine-based approaches
Composition, change and complexity have attracted ev- eryone’s attention towards Self-Adaptive systems. These systems, inspired by the human body, are capable of adapting to changes in the inner and outer environment. The main objective of this study is to achieve a more con- venient availability for e-banking services in the payment switch, using self-healing systems and focusing on the failur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011